On the Randić index and Diameter of Chemical Graphs
نویسنده
چکیده
Using the AutoGraphiX 2 system, Aouchiche, Hansen and Zheng [2] proposed a conjecture that the difference and the ratio of the Randić index and the diameter of a graph are minimum for paths. We prove this conjecture for chemical graphs.
منابع مشابه
A Survey on the Randić Index
The general Randić index Rα(G) of a (chemical) graph G, is defined as the sum of the weights (d(u)d(v))α of all edges uv of G, where d(u) denotes the degree of a vertex u in G and α an arbitrary real number, which is called the Randić index or connectivity index (or branching index) for α = −1/2 proposed by Milan Randić in 1975. The paper outlines the results known for the (general) Randić inde...
متن کاملOn the Modified Randić Index of Trees, Unicyclic Graphs and Bicyclic Graphs
The modified Randić index of a graph G is a graph invariant closely related to the classical Randić index, defined as
متن کاملOn Harmonic Index and Diameter of Unicyclic Graphs
The Harmonic index $ H(G) $ of a graph $ G $ is defined as the sum of the weights $ dfrac{2}{d(u)+d(v)} $ of all edges $ uv $ of $G$, where $d(u)$ denotes the degree of the vertex $u$ in $G$. In this work, we prove the conjecture $dfrac{H(G)}{D(G)} geq dfrac{1}{2}+dfrac{1}{3(n-1)} $ given by Jianxi Liu in 2013 when G is a unicyclic graph and give a better bound $ dfrac{H(G)}{D(G)}geq dfra...
متن کاملOn a Relation Between Randić Index and Algebraic Connectivity
A conjecture of AutoGraphiX on the relation between the Randić index R and the algebraic connectivity a of a connected graph G is: R a ≤ ( n− 3 + 2√2 2 ) / ( 2(1− cos π n ) ) with equality if and only if G is Pn, which was proposed by Aouchiche et al. [M. Aouchiche, P. Hansen and M. Zheng, Variable neighborhood search for extremal graphs 19: further conjectures and results about the Randić inde...
متن کاملOn a Conjecture about the Randić Index and Diameter
The Randić index of a graph G is defined as R(G) = ∑ u∼v (d(u)d(v))− 2 , where d(u) is the degree of vertex u, and the summation goes over all pairs of adjacent vertices u, v. A conjecture of R(G) for connected graph with n vertices is as follows: R(G)−D √2− n+1 2 and R(G) D 1 2 + √ 2−1 n−1 , where D is the diameter of G. In this paper, we prove that this conjecture is true for unicyclic graphs.
متن کامل